A Multilevel Tabu Search with Backtracking for Exploring Weak Schur Numbers
نویسندگان
چکیده
In the field of Ramsey theory, the weak Schur number WS(k) is the largest integer n for which their exists a partition into k subsets of the integers [1, n] such that there is no x < y < z all in the same subset with x+y = z. Although studied since 1941, only the weak Schur numbersWS(1) throughWS(4) are precisely known, for k ≥ 5 theWS(k) are only bracketed within rather loose bounds. We tackle this problem with a tabu search scheme, enhanced by a multilevel and backtracking mechanism. While heuristic approaches cannot definitely settle the value of weak Schur numbers, they can improve the lower bounds by finding suitable partitions, which in turn can provide ideas on the structure of the problem. In particular we exhibit a suitable 6-partition of [1, 574] obtained by tabu search, improving on the current best lower bound for WS(6).
منابع مشابه
APPLICATION OF TABU SEARCH FOR SOLVING THE BI-OBJECTIVE WAREHOUSE PROBLEM IN A FUZZY ENVIRONMENT
The bi-objective warehouse problem in a crisp environment is often not eective in dealing with the imprecision or vagueness in the values of the problem parameters. To deal with such situations, several researchers have proposed that the parameters be represented as fuzzy numbers. We describe a new algorithm for fuzzy bi-objective warehouse problem using a ranking function followed by an applic...
متن کاملAugmenting Metaheuristics with Rewriting Systems
We describe the use of a rewriting system to determine equivalence classes over the search-space of optimisation problems. These equivalence classes may be used to derive redundant subsequences in the search-space for incorporation into metaheuristics such as backtracking, genetic algorithms and tabu-search. We use this approach as the basis for a new tabu-search variant — ‘EquationalTS’ and ap...
متن کاملExperiments of Intelligent Algorithms on Ramsey Graphs
Ramsey numbers are known to be hard combinatorial problems that have many important applications including number theory, algebra, geometry, topology, set theory, logic, ergodic theory, information theory, and theoretical computer science. The evaluation of Ramsey numbers using intelligent algorithms has been extensively studied in the last decades and only few numbers are currently known. Almo...
متن کاملBacktracking based iterated tabu search for equitable coloring
An equitable k-coloring of an undirected graph G = (V,E) is a partition of its vertices into k disjoint independent sets, such that the cardinalities of any two independent sets differ by at most one. As a variant of the graph coloring problem (GCP), the equitable coloring problem (ECP) concerns finding a minimum k for which an equitable k-coloring exists. In this work, we propose a backtrackin...
متن کاملAn Optimized technique for Test Case Generation and Prioritization Using 'Tabu' Search and 'Data Clustering'
In practice, an available testing budget limits the number of test cases that can be executed over particular software. This paper presents a ―Tabu‖ search algorithm for the automatic generation of software test cases and their prioritization through clustering technique of data mining. The developed test case generator has a cost function for intensifying the search and another for diversifyin...
متن کامل